const github.com/klauspost/compress/flate.minMatchLength

20 uses

	github.com/klauspost/compress/flate (current package)
		deflate.go#L38: 	minMatchLength   = 4   // The smallest match that the compressor looks for
		deflate.go#L51: 	hashShift           = (hashBits + minMatchLength - 1) / minMatchLength
		deflate.go#L95: 	hashMatch [maxMatchLength + minMatchLength]uint32
		deflate.go#L132: 	if s.index >= 2*windowSize-(minMatchLength+maxMatchLength) {
		deflate.go#L236: 	loops := (n + 256 - minMatchLength) / 256
		deflate.go#L239: 		end := startindex + 256 + minMatchLength - 1
		deflate.go#L244: 		dstSize := len(tocheck) - minMatchLength + 1
		deflate.go#L287: 	length = minMatchLength - 1
		deflate.go#L412: 	s.length = minMatchLength - 1
		deflate.go#L426: 	if d.windowEnd-s.index < minMatchLength+maxMatchLength && !d.sync {
		deflate.go#L441: 	s.maxInsertIndex = d.windowEnd - (minMatchLength - 1)
		deflate.go#L448: 		if lookahead < minMatchLength+maxMatchLength {
		deflate.go#L481: 		s.length = minMatchLength - 1
		deflate.go#L495: 		if prevLength >= minMatchLength && s.length <= prevLength {
		deflate.go#L610: 			end += minMatchLength - 1
		deflate.go#L616: 			dstSize := len(tocheck) - minMatchLength + 1
		deflate.go#L634: 			s.length = minMatchLength - 1
		deflate.go#L645: 			if s.length >= minMatchLength {
		deflate.go#L879: 		s.length = minMatchLength - 1